NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
491	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
492	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
493	Growing Solver-Aided Languages with ROSETTE Emina Torlak & Rastislav Bodik U.C. Berkeley Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:27:03 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Satisfiability Modulo Theories AMPL Theoretical computer science Applied mathematics Software engineering
494	Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory
495	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
496	Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks George Kao∗ Thomas Fevens∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:53 Routing algorithms Wireless networking Routing protocols Network theory NP-complete problems Geographic routing Routing Unit disk graph Shortest path problem Graph theory Theoretical computer science Mathematics
497	A Memory-Efficient Method for Fast Computation of Short 15-Puzzle Solutions Ian Parberry Technical Report LARCLaboratory for Recreational Computing Department of Computer Science & Engineering Add to Reading List Source URL: larc.unt.edu Language: English - Date: 2014-04-24 15:56:54 Mechanical puzzles Puzzles Combination puzzles NP-complete problems Fads Fifteen puzzle Eternity II puzzle Greedy algorithm Shortest path problem Mathematics Games Theoretical computer science
498	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Geometric Red-Blue Set Cover for Unit Squares and Related Problems Timothy M. Chan∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Vertex cover Set cover problem Monotone polygon NP-complete problems Mathematics Applied mathematics
499	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Hamiltonian Cycles in Triangular Grids Valentin Polishchuk∗ Esther M. Arkin† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:41 Induced path Cycle graph Planar graph Path Petersen graph Panconnectivity Graph theory NP-complete problems Hamiltonian path
500	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics

UPDATE